package class6;

import common.TreeNode;

import java.lang.reflect.Constructor;

/**
 * 使用非递归方式，实现归并排序
 */
public class Code01_MergeSort {

    public static void main(String[] args) throws NoSuchMethodException {


    }

    public static void mergeSort2(int[] arr) {
        if (arr == null || arr.length == 0) {
            return;
        }
        //步长
        int step = 1;
        int N = arr.length;
        while (step < N) {
            int L = 0;
            // 左组小于N
            while (L < N) {
                int M = L + step - 1;
            }

            if (step >= (N / 2)) {
                break;
            } else {
                step *= 2;
            }
        }
    }
}
